Feynman-path-type simulation using stabilizer projector decomposition of unitaries

نویسندگان

چکیده

We propose a classical simulation method for quantum circuits based on decomposing unitary gates into sum of stabilizer projectors. By only the non-Clifford gates, we take advantage Gottesman-Knill theorem and build bridge between stabilizer-based Feynman-path-type simulation. give two variants this method: path-integral recursion (SPIR) projector contraction (SPC). also analyze further advantages disadvantages our compared to Bravyi-Gosset algorithm recursive Feynman algorithms. construct parametrized circuit ensemble identify parameter regime in where offers superior performance. estimate time cost simulating supremacy experiments with motivate potential improvements method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Why Feynman Path Integration?

To describe physics properly, we need to take into account quantum effects. Thus, for every nonquantum physical theory, we must come up with an appropriate quantum theory. A traditional approach is to replace all the scalars in the classical description of this theory by the corresponding operators. The problem with the above approach is that due to non-commutativity of the quantum operators, t...

متن کامل

Beam spread functions calculated using Feynman path integrals

A method of solving the radiative transfer equation using Feynman path integrals (FPIs) is discussed. The FPI approach is a mathematical framework for computing multiple scattering in participating media. Its numerical behavior is not well known, and techniques are being developed to solve the FPI approach numerically. A missing numerical technique is detailed and used to calculate beam spread ...

متن کامل

Repeat-until-success: non-deterministic decomposition of single-qubit unitaries

We present a non-deterministic circuit decomposition technique for approximating an arbitrary single-qubit unitary to within distance that requires significantly fewer non-Clifford gates than deterministic decomposition techniques. We develop “Repeat-Until-Success” (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioni...

متن کامل

Improved Simulation of Stabilizer Circuits

The Gottesman-Knill theorem says that a stabilizer circuit—that is, a quantum circuit consisting solely of controlled-NOT (CNOT), Hadamard, and phase gates—can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor of 2 inc...

متن کامل

Fast simulation of stabilizer circuits using a graph state representation

According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the graph-state formalism. We also present an implementation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2021

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.103.022428